An implementation of Newton's method for Keating's potential optimization problems

A modification of Newton’s method for solving multidimensional problems of Keating’s potential optimization is addressed. The proposed approach is based on two main futures: information about the special structure of Hessian matrix and sparse matrix technology. Developed data structures for store sparse Hessian matrix and modification of the linear conjugate method for the Hessian matrices with non-positive determinant are considered. The results of computational experiments and comparable tests are presented.